Termination w.r.t. Q proof of TRS/SK904.45.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, x) → a
f(g(x), y) → f(x, y)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, x) → a
f(g(x), y) → f(x, y)

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

[f₂, g_1] > a

Status:

a: multiset
f₂: [2,1]
g₁: [1]